Reordering Diagonal Blocks in Real Schur Form
نویسندگان
چکیده
We present a direct algorithm for computing an orthogonal similarity transformation which interchanges neighboring diagonal blocks in a matrix in real Schur form. The algorithm does not require the solution of the associated Sylvester equation. Numerical tests suggest the backward stability of the scheme.
منابع مشابه
Direct Eigenvalue Reordering in a Product of Matrices in Extended Periodic Real Schur Form∗
A direct method for eigenvalue reordering in a product of a K-periodic matrix sequence in periodic or extended periodic real Schur form is presented and analyzed. Each reordering of two adjacent sequences of diagonal blocks is performed tentatively to guarantee backward stability and involves solving a K-periodic Sylvester equation (PSE) and constructing a K-periodic sequence of orthogonal tran...
متن کاملComputing Periodic Deflating Subspaces Associated with a Specified Set of Eigenvalues
We present a direct method for reordering eigenvalues in the generalized periodic real Schur form of a regular K-cyclic matrix pair sequence (Ak, Ek). Following and generalizing existing approaches, reordering consists of consecutively computing the solution to an associated Sylvester-like equation and constructingK pairs of orthogonal matrices. These pairs define an orthogonal K-cyclic equival...
متن کاملA Schur-Parlett Algorithm for Computing Matrix Functions
An algorithm for computing matrix functions is presented. It employs a Schur decomposition with reordering and blocking followed by the block form of a recurrence of Parlett, with functions of the nontrivial diagonal blocks evaluated via a Taylor series. A parameter is used to balance the conflicting requirements of producing small diagonal blocks and keeping the separations of the blocks large...
متن کاملDirect Eigenvalue Reordering in a Product of Matrices in Periodic Schur Form
A direct method for eigenvalue reordering in a product of a K-periodic matrix sequence in periodic or extended periodic real Schur form is presented and analyzed. Each reordering of two adjacent sequences of diagonal blocks is performed tentatively to guarantee backward stability and involves solving a K-periodic Sylvester equation (PSE) and constructing a K-periodic sequence of orthogonal tran...
متن کاملAn Algorithm of Ordered Schur Factorization For Real Nonsymmetric Matrix
In this paper, we present an algorithm for computing a Schur factorization of a real nonsymmetric matrix with ordered diagonal blocks such that upper left blocks contains the largest magnitude eigenvalues. Especially in case of multiple eigenvalues, when matrix is non diagonalizable, we construct an invariant subspaces with few additional tricks which are heuristic and numerical results shows t...
متن کامل